Modal Propositional Semantics for Reason Maintenance Systems

نویسنده

  • Allen L. Brown
چکیده

Non-monotonic logics are examined and found to be inadequate as descriptions of reason maintenance systems (sometimes called truth maintenance systems). A logic is proposed that directly addresses the problem of characterizing the mental states of a reasoning agent attempting to reason with respect to some object theory. The proposed logic, propositional dynamic logic of derivation (PDLD), is given a semantics, and a sound and complete axiomatization. The descriptive power of PDLD is demonstrated by expressing various inferential control policies as PDLD formulae. In this note I will elaborate the propositional fragment of an axiomatic semantics of reason maintenance systems (RMS's) [Do2]. The development of such a semantics stems from the desire to provide a declarative specification language for RMS's with particular emphasis on the description of the control of their reasoning processes, and to serve as a formal setting within which to compare and contrast the properties of different RMS's.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality for Logics of Transition Systems

We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X . The propositional logic used to reason about state spaces from X is modelled by the Stone dual A of X (e.g. if X is Stone spaces then A is Boolean algebras and the propositional logic is the classical one). In order to obtain a m...

متن کامل

Quantified epistemic logics for reasoning about knowledge in multi-agent systems

We introduce quantified interpreted systems, a semantics to reason about knowledge in multi-agent systems in a first-order setting. Quantified interpreted systems may be used to interpret a variety of first-order modal epistemic languages with global and local terms, quantifiers, and individual and distributed knowledge operators for the agents in the system. We define first-order modal axiomat...

متن کامل

A simple logic for reasoning about incomplete knowledge

The semantics of modal logics for reasoning about belief or knowledge is often described in terms of accessibility relations, which is too expressive to account for mere epistemic states of an agent. This paper proposes a simple logic whose atoms express epistemic attitudes about formulae expressed in another basic propositional language, and that allows for conjunctions, disjunctions and negat...

متن کامل

Modal Kleene Algebra and Applications — A Survey —

Modal Kleene algebras are Kleene algebras with forward and backward modal operators, defined via domain and codomain operations. They provide a concise and convenient algebraic framework that subsumes various popular calculi and allows treating quite a number of areas. We survey the basic theory and some prominent applications. These include, on the system semantics side, wlp and wp calculus, P...

متن کامل

Algebraic semantics for a modal logic close to S1

The modal systems S1–S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which generalizes a reference rule of S1. In system S1+SP, the relation of strict equivalence φ ≡ ψ satisfies the identity axioms of R. Suszko’s non-Fregean logic adapted t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985